Ackermann Function

In the computational sciences, the Ackermann function (represented as A(m,n) is the simplest example of a total function (a function defined for all possible input values) which is computable but not primitive recursive, which was originally formulated to disprove the once-common belief that every computable function was also primitive recursive, but is now used to generate absurdly large numbers to horrify mathematicians.